BRICS Basic Research in Computer Science BRICS RSDanvy & Rose: Higher-Order Rewriting and Partial Evaluation Higher-Order Rewriting and

Source URL: repository.readscheme.org

• Lambda calculus
• Computability theory
• Theoretical computer science
• Logic in computer science
• Combinatory logic
• Recursion
• Term
• Free variables and bound variables
• Lambda calculus definition

Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract

Source URL: repository.readscheme.org

• Lambda calculus
• Combinatory logic
• Church encoding
• Fixed-point combinator
• Anonymous function
• Higher-order abstract syntax
• Type system
• Unification
• De Bruijn index
• Lambda calculus definition

Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany

Source URL: people.mpi-inf.mpg.de

• Category theory
• Functional programming
• F-algebra
• F-coalgebra
• Functor
• Initial algebra
• Monad
• Equivalence of categories
• Coalgebra
• Stoneech compactification

Higher-Order Representation Predicates in Separation Logic Arthur Charguéraud Inria, Université Paris-Saclay, France LRI, CNRS & Univ. Paris-Sud, Université Paris-Saclay, France

Source URL: chargueraud.org

FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Metalogic
• Reverse mathematics
• Primitive recursive functional
• Second-order arithmetic
• Peano axioms
• Primitive recursive function
• Primitive recursive arithmetic
• Model theory
• Symbol

Separation Logic for a Higher-Order Typed Language [Extended Abstract] Neelakantan Krishnaswami Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213

Source URL: www.mpi-sws.org

Modular Verification of the Subject-Observer Pattern via Higher-Order Separation Logic Neelakantan R. Krishnaswami, Jonathan Aldrich1 , and Lars Birkedal2 1 Carnegie Mellon University, {neelk, aldrich}@cs.cmu.edu

Source URL: www.mpi-sws.org

Nunchaku: Flexible Model Finding for Higher-Order Logic Simon Cruanes, Jasmin Blanchette, Andrew Reynolds Veridis, Inria Nancy https://cedeela.fr/~simon/ April 7th, 2016

Source URL: cedeela.fr

• Logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution

Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic Neelakantan R. Krishnaswami CMU-CSJuly 6, 2011

Source URL: www.mpi-sws.org

REDUCING HIGHER-ORDER THEOREM PROVING TO A SEQUENCE OF SAT PROBLEMS CHAD E. BROWN Abstract. We describe a complete theorem proving procedure for higher-order logic that uses SAT-solving to do much of the

Source URL: www.ps.uni-saarland.de